Manipulability of Single Transferable Vote
نویسنده
چکیده
For many voting rules, it is NP-hard to compute a successful manipulation. However, NP-hardness only bounds the worst-case complexity. Recent theoretical results suggest that manipulation may often be easy in practice. We study empirically the cost of manipulating the single transferable vote (STV) rule. This was one of the first rules shown to be NP-hard to manipulate. It also appears to be one of the harder rules to manipulate since it involves multiple rounds and since, unlike many other rules, it is NP-hard for a single agent to manipulate without weights on the votes or uncertainty about how the other agents have voted. In almost every election in our experiments, it was easy to compute how a single agent could manipulate the election or to prove that manipulation by a single agent was impossible. It remains an interesting open question if manipulation by a coalition of agents is hard to compute in practice.
منابع مشابه
On the Manipulability of Voting Systems: Application to Multi-Carrier Networks
Today, Internet involves many actors who are making revenues on it (operators, companies, service providers,...). It is therefore important to be able to make fair decisions in this large-scale and highly competitive economical ecosystem. One of the main issues is to prevent actors from manipulating the natural outcome of the decision process. For that purpose, game theory is a natural framewor...
متن کاملAn Empirical Study of the Manipulability of Single Transferable Voting
Voting is a simple mechanism to combine together the preferences of multiple agents. Agents may try to manipulate the result of voting by mis-reporting their preferences. One barrier that might exist to such manipulation is computational complexity. In particular, it has been shown that it is NP-hard to compute how to manipulate a number of different voting rules. However, NP-hardness only boun...
متن کاملA New Method of the Single Transferable Vote and its Axiomatic Justification
We propose a new method of the Single Transferable Vote (STV) and give a unified way to describe classic procedures (Gregory Method, Inclusive Gregory Method and Weighted Inclusive Gregory Method) as an iterative procedure. A modification for quota definition is proposed which improves theoretical properties of the procedures. The method is justified by a new set of axioms. It is shown that thi...
متن کاملIf you like the alternative vote ( a . k . a . the instant runoff ) , then you ought to know about the Coombs rule
We consider four factors relevant to picking a voting rule to be used to select a single candidate from among a set of choices: (1) avoidance of Condorcet losers, (2) choice of Condorcet winners, (3) resistance to manipulability via strategic voting, (4) simplicity. However, we do not try to evaluate all voting rules that might be used to select a single alternative. Rather, our focus is restri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0911.3708 شماره
صفحات -
تاریخ انتشار 2010